Inequalities for covering codes
نویسندگان
چکیده
Any code C with covering radius R must satisfy a set of linear inequalities that involve the Lloyd polynomial L R (x) ; these generalize the sphere bound. The "syndrome graphs" associated with a linear code C help to keep track of low weight vectors in the same coset of C (if there are too many such vectors C cannot exist). As illustrations it is shown that t[17,10] = 3 and t[23,15] = 3, where t [ n , k ] is the smallest covering radius of any [ n , k ] code.
منابع مشابه
Some new lower bounds for ternary covering codes
In [5], we studied binary codes with covering radius one via their characteristic functions. This gave us an easy way of obtaining congruence properties and of deriving interesting linear inequalities. In this paper we extend this approach to ternary covering codes. We improve on lower bounds for ternary 1-covering codes, the so-called football pool problem, when 3 does not divide n − 1. We als...
متن کاملClassifying Optimal Ternary Codes of Length 5 and Covering Radius 1
It is well known that optimal ternary codes of length 5 and covering radius 1 have 27 codewords. The structure of such optimal codes has been studied, but a classification of these is still lacking. In this work, a complete classification is carried out by constructing codes coordinate by coordinate in a backtrack search. Linear inequalities and equivalence checking are used to prune the search...
متن کاملOn the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}
In an earlier paper [I1 we characterized the class of facets of the set covering polytope defined by inequalities with coefficients equal to 0, 1 or S2. -iT this paper we connects/that characterization to the theory of facet lifting. In particular, we-introduc~ a family of lower dimensional polytopes and associated inequalities having only three nonzero coefficients, whose lifting yields all th...
متن کاملFurther Results on the Covering Radii of the Reed-Muller Codes
Let R(r, m) by the rth order Reed-Muller code of length 2 )n, and let o(r, m) be its covering radius. We obtain the following new results on the covering radius of R(r, m): 1. p(r + 1, m + 2) > 2p(r, m) + 2 if 0 < r < m 2. This improves tile successive use of the known inequalities p(r + 1, m + 2) _> 20 (r + 1, m + 1) and p (r + 1, m + 1) -> O (r, m). 2. P (2, 7) -< 44. Previously best known up...
متن کاملMathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 1988